Free word problems for additive relation algebras of modules
نویسندگان
چکیده
منابع مشابه
Cut-free Display Calculi for Relation Algebras
We extend Belnap's Display Logic to give a cut-free Gentzen-style calculus for relation algebras. The calculus gives many axiomatic extensions of relation algebras by the addition of further structural rules. It also appears to be the rst purely propositional Gentzen-style calculus for relation algebras.
متن کاملStrongly Multiplicity Free Modules for Lie Algebras and Quantum Groups
Let U be either the universal enveloping algebra of a complex semisimple Lie algebra g or its Drinfel’d-Jimbo quantisation over the field C(z) of rational functions in the indeterminate z. We define the notion of “strongly multiplicity free” (smf) for a finite dimensional U-module V , and prove that for such modules the endomorphism algebras EndU (V ⊗r) are “generic” in the sense that they are ...
متن کاملSimple Word Problems in Universal Algebras’
An algor i thm is descr ibed which is capable of solving cer ta in word problems: i .e . of deciding whether or not two words composed of var iables and operators can be proved equal as a consequence of a given set of identities satisf ied by the opera tors . Al though the genera l word problem is wel l known to be unsolvable, this algorithm provides results in many interesting cases. For examp...
متن کاملComputation of bases of free modules over the Weyl algebras
A well-known result due to J. T. Stafford asserts that a stably free left module M over the Weyl algebras D = An(k) or Bn(k) − where k is a field of characteristic 0 − with rankD(M) ≥ 2 is free. The purpose of this paper is to present a new constructive proof of this result as well as an effective algorithm for the computation of bases of M . This algorithm, based on the new constructive proofs...
متن کاملDecision Problems for Equational Theories of Relation Algebras
The foundation of an algebraic theory of binary relations was laid by C. S. Peirce, building on earlier work of Boole and De Morgan. The basic universe of discourse of this theory is a collection of binary relations over some set, and the basic operations on these relations are those of forming unions, complements, relative products (i.e., compositions), and converses (i.e., inverses). There is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Pure and Applied Algebra
سال: 1988
ISSN: 0022-4049
DOI: 10.1016/0022-4049(88)90111-9